Adaptive vector modulation method and system

ABSTRACT

A transceiver for implementing an adaptive vector modulation method is disclosed. In response to a binary stream assembled into groups of bits forming symbol indices, a transmitter of the transceiver generates one or more complex values symbols that are normalized over channel coefficients associated with one or more propagation channels between one or more transmitter antennas and one or more receiver antennas. The transmitter controls a transmission of the complex values symbol(s) from the transmitter antenna(s) to a selected receiver antenna. The selection of the receiver antenna is based upon a metric proportional to the average injection power or a vector norm corresponding to each receiver antenna of the receiver antenna(s).

FIELD OF THE INVENTION

[0001] In general, the present invention relates to the field of communication systems. More specifically, the present invention relates to multi-antenna transceivers and links within wireless systems.

BACKGROUND OF THE INVENTION

[0002] Prior art wireless communication systems such as 2^(nd) and 3^(rd) generation cellular systems (e.g., ETSI GSM, TIA IS-95, 3GPP UMTS, etc.) and wireless local area network systems (e.g., IEEE 802.11b) are generally capable of sustaining maximum information bit rates of approximately 20 Mbps or less. Future applications for extremely high speed personal wireless communication links anticipate information bit rates well above 100 Mbps. Further, the personal (and possibly wearable) nature of the services anticipated to be supported by such links require extremely low-power operation, and therefore minimal complexity in baseband signal processing (including demodulation and error correction stages).

[0003] The present invention offers an improved capacity for communication systems employing a high speed link capacity with low associated signal processing complexity.

SUMMARY OF THE INVENTION

[0004] One form of the present invention is a method of operating a transceiver including one or more transmitter antennas, at least one receiver antenna, and one or more propagation channels between the one or more transmitter antennas and the one or more receiver antennas. First, a binary stream assembled into groups of bits forming symbol indices is received by the transceiver. Second, the transceiver generates at least one complex symbol value in response to a reception of the binary stream with each one complex symbol value being normalized over one or more channel coefficients associated with the propagation channel(s). Thereafter, one of the receiver antennas is selected to receiver the at least one complex symbol value from the transmitter antenna(s). In one aspect, the selection of the receiver antenna is a function of a metric proportional to an average injection power corresponding to the selected receiver antenna. In another aspect, the selection of the receiver antenna is a function of a vector norm corresponding to the selected receiver antenna.

[0005] The foregoing form as well as other forms, features and advantages of the invention will become further apparent from the following detailed description of the presently preferred embodiment, read in conjunction with the accompanying drawings. The detailed description and drawings are merely illustrative of the invention rather than limiting, the scope of the invention being defined by the appended claims and equivalents thereof.

BRIEF DESCRIPTION OF THE DRAWINGS

[0006]FIG. 1 illustrates a block diagram of one embodiment of an adaptive vector modulation transceiver in accordance with the present invention;

[0007]FIG. 2 illustrates a block diagram of a first embodiment of a spatial mapping module and a first embodiment of a receiver of the FIG. 1 adaptive vector modulation transceiver;

[0008]FIG. 3 illustrates a flowchart representative of a first embodiment of a receiver antenna selection method in accordance with the present invention;

[0009]FIG. 4 illustrates a flowchart representative of a second embodiment of a receiver antenna selection method in accordance with the present invention;

[0010]FIG. 5 illustrates a block diagram of a second embodiment of a spatial mapping module of the FIG. 1 adaptive vector modulation transceiver; and

[0011]FIG. 6 illustrates a block diagram of a second embodiment of a receiver of the FIG. 1 adaptive vector modulation transceiver.

DETAILED DESCRIPTION OF THE PRESENTLY PREFERRED EMBODIMENTS

[0012]FIG. 1 illustrates one embodiment of an adaptive vector modulation (AVM) system transceiver 10 (hereinafter “AVM transceiver 10”) in accordance with the present invention. A transmitter of the AVM transceiver 10 includes a symbol modulator 20 and a spatial mapping module 30. The symbol modulator 20 receives as an input a binary information stream assembled into groups of K bits forming symbol indices J. In response thereto, the symbol modulator 20 conventionally provides a generally complex-valued Quadrature Amplitude Modulation (QAM) symbol s_(J) in the form of a member of any well-known constellation (e.g., 16-QAM, 64-QAM, etc.). The spatial mapping module 30 receives the modulation symbol s_(J), and in response thereto, the spatial mapping module 30 generally directs a transmission of M_(T) complex symbol values (not shown) from each of M_(T) transmitter antennas where 1≦M_(T). In the embodiment of FIG. 1, M_(T)=3 whereby spatial mapping module 30 specifically directs a transmission of three (3) complex symbol values (not shown) from a transmitter antenna TX₀, a transmitter antenna TX₁ and a transmitter antenna TX₂, respectively.

[0013] The transmitted complex symbol values are received by one of M_(R) receiver antennas where 1≦M_(R), and M_(T) and M_(R) may or may not have identical values. In the embodiment of FIG. 1, M_(R)=3 whereby the transmitted complex symbol values are received by one of a receiver antenna RX₀, a receiver antenna RX₁, and a receiver antenna RX₂. The complex symbol values transmitted from each transmitter antenna TX₀-TX₂ are weighted versions of modulation symbol s_(J) where the weights are a function of the receiver antenna among the receiver antennas RX₀-RX₂ selected to receive the complex symbol values, and the propagation channels between the M_(T) transmitter antennas and the M_(R) candidate receiver antennas. The result is a normalization of the complex symbol values over the channel coefficients associated with the propagation channels.

[0014] Upon reception of the complex symbol values by the selected receiver antenna, the receiver 40 demodulates the complex symbol values to recover an estimate of the modulation symbol s_(J) to thereby generate an estimate of the transmit symbol index J to obtain the binary information sequence input to the symbol modulator 20.

[0015] The symbol modulator 20, the spatial mapping module 30, and the receiver 40 may be implemented in hardware (analog or digital), software, or any combination of hardware and software. From a subsequent description of various embodiments of the spatial mapping module 30 and the receiver 40, those having ordinary skill in the art will appreciate a sequential operation of the components of the symbol modulator 20, the spatial mapping module 30, and the receiver 40 (e.g., in a software implementation) and a concurrent operation of the symbol modulator 20, the spatial mapping module 30, and the receiver 40 (e.g., in a hardware implementation).

[0016]FIG. 2 illustrates a spatial mapping module 30 a (for the particular case of M_(T)=3) as one embodiment of the spatial mapping module 30 (FIG. 1) and a receiver 40 a as one embodiment of the receiver 40 (FIG. 1). In response to the modulation symbol s_(J), and selection of the i-th receiver antenna, the spatial mapping module 30 a generates a complex symbol value x₀, a complex symbol value x₁, and a complex symbol value x₂ in accordance with the following general equation [1]: $\begin{matrix} {{x_{m} = {{\frac{\sqrt{E_{s}}\left( h_{i,m}^{*} \right)}{\sum\limits_{j = 0}^{M_{T} - 1}\left| h_{i,j} \right|^{2}}s_{j}\quad m} = 0}},1,\ldots \quad,{M_{T} - 1}} & \lbrack 1\rbrack \end{matrix}$

[0017] where E_(s) is a desired mean received symbol energy, M_(T) is the number of transmitter antennas (M_(T)=3 for the spatial mapping module 30 a), and h_(i,j) is a complex-valued channel coefficient.

[0018] For this particular implementation, the complex-valued baseband-equivalent channels connecting the transmitter antennas TX₀-TX₂ with each of the receiver antennas RX₀-RX₂ is assumed to comprise a single coefficient (conventionally referred to as a ‘flat’ channel). Accordingly, there are M_(R)×M_(T) distinct channel coefficients. In one embodiment, the channel coefficients are organized into a matrix L₁ having M_(R) rows (or groups) of M_(T) coefficients (equivalently, M_(R) length-M_(T) row vectors) in accordance with the following equation [2]: $\begin{matrix} {L_{1} = {\begin{bmatrix} h_{1,1} & h_{1,2} & \cdots & h_{1,M_{T}} \\ h_{2,1} & h_{2,2} & \cdots & \vdots \\ \vdots & \vdots & ⋰ & \vdots \\ h_{M_{R},1} & \cdots & \cdots & h_{M_{R},M_{T}} \end{bmatrix} = \begin{bmatrix} h_{1} \\ h_{2} \\ \vdots \\ h_{M_{R}} \end{bmatrix}}} & \lbrack 2\rbrack \end{matrix}$

[0019] where each group comprises the M_(T) channel coefficients connecting the transmitter antennas TX₀-TX₂ to one of the receiver antennas RX₀-RX_(2.)

[0020] A transmission of the complex symbol value x₀, the complex symbol value x₁, and the complex symbol value x₂ from the transmission antennas TX₀-TX₂, respectively, is directed along a subset of the channel coefficients of equation [2] in accordance with the antenna selection method of the present invention.

[0021]FIG. 3 illustrates a flowchart 50 representative of one embodiment of a receiver antenna selection method. During a stage S52 of the flowchart 50, a metric proportional to the average injection power (AIP) (where the averaging process is defined with respect to the transmitted symbol process—whose component symbols may not have constant energy—and assumes the fading channel coefficients are approximately constant for a particular interval) corresponding to selection of the i-th (of M_(R)) candidate receiver antennas is computed in accordance with the following equation [3]: $\begin{matrix} {{AIP}_{i} = \frac{1}{\sum\limits_{j = 0}^{M_{T} - 1}\left| h_{i,j} \right|^{2}}} & \lbrack 3\rbrack \end{matrix}$

[0022] During a stage S54 of the flowchart 50, the receiver antenna (selected over index i) having the smallest average injection power metric AIP_(i) is selected, and that receiver antenna is then used to receive the complex symbol value x₀, the complex symbol value x₁, and the complex symbol value x₂ after implicit processing by the corresponding selected channel coefficient vector h_(i) according to the definitions of equation [2].

[0023]FIG. 4 illustrates a flowchart 60 representative of another embodiment of a receiver antenna selection method. During a stage S62 of the flowchart 60, the L₂ vector norm (VN) of the row vector h_(i) corresponding to each of the M_(R) candidate receiver antennas is computed in accordance with the following equation [4]: $\begin{matrix} {{VN}_{i} = {{\sum\limits_{j = 0}^{M_{T} - 1}\left| h_{i,j} \right|^{2}} = {h_{i}}_{2}^{2}}} & \lbrack 4\rbrack \end{matrix}$

[0024] During a stage S64 of the flowchart 60, the channel having the highest vector norm VN_(i) is selected, and the corresponding i-th receiver antenna is used to receive the complex symbol value x₀, the complex symbol value x₁, and the complex symbol value x₂ after implicit processing by the corresponding selected channel coefficients h_(i).

[0025] In one embodiment, the spatial mapping module 30 a executes either the flowchart 50 or the flowchart 60, and communicates the receiver antenna selection to a switch 41 of the receiver 40 a. In a second embodiment, the switch 41 executes either the flowchart 50 or the flowchart 60, and communicates the receiver antenna selection to the spatial mapping module 30 a. In a third embodiment, both the spatial mapping module 30 a and the switch 41 execute either the flowchart 50 and/or the flowchart 60, and handshake as to the receiver antenna selection.

[0026] In response to the receiver antenna selection, the switch 41 establishes a communication between the receiving antenna associated with the selected channel and a slicer 42 (which could equivalently be termed a hard-decision symbol estimator). For example, upon a selection of the channel 1, the switch 41 establishes a communication between the receiving antenna RX₁, and the slicer 42 as exemplary illustrated in FIG. 2. The slicer 42 receives a modulation signal ŝ_(J) that is an estimation of modulation signal s_(J). In response thereto, the slicer 42 conventionally generates a group of bits Ĵ as an estimate of the symbol index J (FIG. 1).

[0027] The description above was particularly intended for use in channels where each channel coefficient comprises a single complex-valued coefficient. The invention can be extended to include so-called frequency-selective channels (i.e., where the channel comprises a non-zero length time-series of complex-valued coefficients).

[0028]FIG. 5 illustrates a spatial mapping module 30 b as another embodiment of spatial mapping module 30 (FIG. 1). The spatial mapping module 30 b is an extension of the present invention to frequency-selective channels using the well-known technique of Orthogonal Frequency Division Modulation (OFDM). In response to a length-N sequence of modulation symbols s_(J), a serial to parallel converter 31 conventionally concatenates the N modulation symbols s_(J) into a group of modulation symbols s_(J)[0], . . . , s_(J)[N−1]. A spatial mapper 32 provides a group of complex symbol values X₀[0], . . . , X₀[N−1], a group of complex symbol values X₁[0], . . . , X₁[N−1] and a group of complex symbol values X₂[0], . . . , X₂[N−1] as a function of modulation symbols s_(J)[0], . . . , s_(J)[N−1].

[0029] In one embodiment, given the selection of the i-th receiver antenna, the spatial mapper 32 generates complex symbol values X₀[0], . . .,X₀[N−1], complex symbol values X₁[0], . . .,X₁[N−1] and complex symbol values X₂[0], . . . ,X₂[N−1] in accordance with the following equation [5]: $\begin{matrix} {{X_{j}\lbrack k\rbrack} = {\frac{\sqrt{E_{s}}\left( {H_{i,j}^{*}\lbrack k\rbrack} \right)}{\sum\limits_{m = 0}^{M_{T} - 1}\left| {H_{i,m}\lbrack k\rbrack} \right|^{2}}{s_{j}\lbrack k\rbrack}\quad {\quad\quad {{k = 0},{\quad{1,\ldots \quad,{{N - 1};{j = 0}},1,\ldots \quad,{M_{T} - 1}}}}}}} & \lbrack 5\rbrack \end{matrix}$

[0030] where H_(i,j)[k] is generally the single frequency-domain complex-valued channel coefficient corresponding to the k-th (of N) OFDM sub-channel connecting the j-th transmitter antenna to the i-th receiver antenna.

[0031] An inverse Fast Fourier Transform 33 a (“IFFT 33 a”) conventionally transforms the group of frequency-domain complex symbol values X₀[0], . . . ,X₀[N−1] into a group of time-domain complex symbol values x₀[0], . . . ,x₀[N−1]. A parallel/serial converter 34 a conventionally converts the group of time-domain complex symbol values x₀[0], . . . ,x₀[N−1] into a time-domain complex symbol sequence denoted x₀. A cyclic redundancy module 35 a conventionally adds a cyclic prefix and/or cyclic postfix to the time-domain complex symbol sequence x₀ to yield a time-domain complex symbol sequence z₀.

[0032] An IFFT 33 b conventionally transforms the group of frequency-domain complex symbol values X₁[0], . . . ,X₁[N−1] into a group of time-domain complex symbol values x₁[0], . . . ,x₁[N−1]. A parallel/serial converter 34 b conventionally converts the group of time-domain complex symbol values x₁[0], . . . ,x₁[N−1] into a time-domain complex symbol sequence x₁. A cyclic redundancy module 35 b conventionally adds a cyclic prefix and/or cyclic postfix to the time-domain complex symbol sequence x₁ to yield a time-domain complex symbol sequence z₁.

[0033] An IFFT 33 c conventionally transforms the group of frequency-domain complex symbol values X₂[0], . . . ,X₂[N−1] into a group of time-domain complex symbol values x₂[0], . . . ,x₂[N−1]. A parallel/serial converter 34 c conventionally converts the group of time-domain complex symbol values x₂[0], . . . ,x₂[N−1] into a time-domain complex symbol sequence x₂. A cyclic redundancy module 35 c conventionally adds a cyclic prefix and/or cyclic postfix to the time-domain complex symbol sequence x₂ to yield a time-domain complex symbol sequence z₂.

[0034] The cyclic prefixes and/or cycle postfixes added to time-domain complex symbol sequences x₀-x₂ are determined by factors such as, for example, a maximum channel time-dispersion.

[0035]FIG. 6 illustrates an OFDM receiver 40 b as another embodiment of the receiver 40 (FIG. 1). The switch 41 can operated as previously described herein in connection with the flowchart 50 (FIG. 3) with the metric proportional to the average injection power (AIP) (where averaging is again defined with respect to the transmitted symbol process, for a set of channel coefficients assumed constant over an interval) corresponding to each candidate (i -th) receiver antenna computed in accordance with the following equation [7]: $\begin{matrix} {{AIP}_{i} = {\sum\limits_{k = 0}^{N - 1}\left( \frac{1}{\sum\limits_{j = 0}^{M_{T} - 1}\left| {H_{i,j}\lbrack k\rbrack} \right|^{2}} \right)}} & \lbrack 7\rbrack \end{matrix}$

[0036] Alternatively, the switch 41 can operated as previously described herein in connection with the flowchart 60 (FIG. 4) with the vector norm VN of the channel corresponding to the i-th receiver antenna is computed in accordance with the following equation [8]: $\begin{matrix} {{VN}_{i} = {{\sum\limits_{k = 0}^{N - 1}\left( {\sum\limits_{j = 0}^{M_{T} - 1}\left| {H_{i,j}\lbrack k\rbrack} \right|^{2}} \right)} = {\sum\limits_{k = 0}^{N - 1}{{H_{i}\lbrack k\rbrack}}_{2}^{2}}}} & \lbrack 8\rbrack \end{matrix}$

[0037] where—in a manner similar to equation [2] —the row vector H_(i)[k] is defined as the length—M_(T) vector comprising

H_(i)[k]=[H_(i,0)[k]H_(i,1)[k]. . . H_(i,M) ^(T) [k]].

[0038] A cyclic redundancy module 42 receives a time-domain complex symbol sequence Z_(r), and in response thereto, conventionally removes the cyclic prefix and/or the cyclic postfix to yield a time-domain complex symbol sequence x_(r). A serial/parallel converter 43 conventionally converts the time-domain complex symbol sequence x_(r) into a group of time-domain complex symbol values x_(r)[0], . . . ,x_(r)[N−1]. A Fast Fourier Transform 44 (“FFT 44”) conventionally transforms the time-domain complex symbol values x_(r)[0], . . .,x_(r)[N−1] into a group of frequency-domain complex symbol values ŝ_(j)[0]−ŝ_(j)[N−1]. A parallel/serial converter 45 conventionally converts the frequency-domain complex symbol values ŝ_(J)[0]−ŝ_(J)[N−1] into a set of N estimated modulation symbols ŝ_(J) that is an estimate of modulation symbols s_(J) (FIG. 1). The slicer 46 conventionally generates N symbol index estimates Ĵ each identifying K bits (FIG. 1).

[0039] The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes that come within the meaning and range of equivalency of the claims are to be embraced within their scope. 

We claim:
 1. A method of operating a transceiver including one or more transmitter antennas, at least one receiver antenna, and one or more propagation channels between the one or more transmitter antennas and the one or more receiver antennas, said method comprising: receiving a binary stream assembled into groups of bits forming symbol indices; and generating at least one complex symbol value in response to a reception of the binary stream, each complex symbol value of the at least one complex symbol value being normalized over one or more channel coefficients associated with the one or more propagation channels.
 2. The method of claim 1, wherein the at least one complex symbol value is generated according to: ${x_{m} = {{\frac{\sqrt{E_{s}}\left( h_{i,m}^{*} \right)}{\sum\limits_{j = 0}^{M_{T} - 1}\left| h_{i,j} \right|^{2}}s_{j}\quad m} = 0}},1,\ldots \quad,{M_{T} - 1}$

where i is an index of a selected receiver antenna to receive the at least one complex symbol value.
 3. The method of claim 1, wherein the at least one complex symbol value is generated according to: ${X_{j}\lbrack k\rbrack} = {\frac{\sqrt{E_{s}}\left( {H_{i,j}^{*}\lbrack k\rbrack} \right)}{\sum\limits_{m = 0}^{M_{T} - 1}\left| {H_{i,m}\lbrack k\rbrack} \right|^{2}}{s_{j}\lbrack k\rbrack}\quad {\quad\quad {{k = 0},{\quad{1,\ldots \quad,{{N - 1};{j = 0}},1,\ldots \quad,{M_{T} - 1}}}}}}$

where i is an index of a selected receiver antenna to receive the at least one complex symbol value.
 4. The method of claim 1, further comprising: selecting a first receiver antenna of the one or more receiver antennas as a function of a metric proportional to an average injection power corresponding to the first receiver antenna; and transmitting the at least one complex symbol value from the one or more transmitter antennas to the first receiver antenna.
 5. The method of claim 1, further comprising: selecting a first receiver antenna of the one or more receiver antennas as a function of a vector norm corresponding to the first receiver antenna; and transmitting the at least one complex symbol value from the one or more transmitter antennas to the first receiver antenna.
 6. A transceiver, comprising: one or more transmitter antennas; one or more receiver antennas; one or more propagation channels between said one or more transmitter antennas and said one or more receiver antenna; and a transmitter operable to generate at least one complex symbol value in response to a reception of a binary stream assembled into groups of bits forming symbol indices, each complex symbol value of the at least one complex symbol value being normalized over one or more channel coefficients associated with said one or more propagation channels.
 7. The transceiver of claim 6, wherein said transmitter generates the at least one complex symbol value according to: ${x_{m} = {{\frac{\sqrt{E_{s}}\left( h_{i,m}^{*} \right)}{\sum\limits_{j = 0}^{M_{T} - 1}\left| h_{i,j} \right|^{2}}s_{j}\quad m} = 0}},1,\ldots \quad,{M_{T} - 1}$

where i is an index of a selected receiver antenna to receive the at least one complex symbol value.
 8. The transceiver of claim 6, wherein said transmitter generates the at least one complex symbol value according to: ${{X_{j}\lbrack k\rbrack} = {{\frac{\sqrt{E_{s}}\left( {H_{i,j}^{*}\lbrack k\rbrack} \right)}{\sum\limits_{m = 0}^{M_{T} - 1}\left| {H_{i,m}\lbrack k\rbrack} \right|^{2}}{S_{j}\lbrack k\rbrack}\quad k} = 0}},1,\cdots \quad,{{N - 1};{j = 0}},1,\cdots \quad,{M_{T} - 1}$

where i is an index of a selected receiver antenna to receive the at least one complex symbol value.
 9. The transceiver of claim 6, wherein: said transmitter is further operable to select a first receiver antenna of said one or more receiver antennas as a function of a metric proportional to an average injection power of corresponding to said first receiver antenna; and said one or more transmitting antennas are operable to transmit the at least one complex symbol value to said first receiver antenna.
 10. The transceiver of claim 6, further comprising: a receiver operable to select a first receiver antenna of said one or more receiver antennas as a function of a metric proportional to an average injection power corresponding to said first receiver antenna, wherein said one or more transmitting antennas are operable to transmit the at least one complex symbol value to said first receiver antenna.
 11. The transceiver of claim 6, wherein: said transmitter is further operable to select a first receiver antenna of said one or more receiver antennas as a function of a vector norm corresponding to said first receiver antenna; and said one or more transmitter antennas are operable to transmit the at least one complex symbol value to said first receiver antenna.
 12. The transceiver of claim 6, further comprising: a receiver operable to select a first receiver antenna of said one or more receiver antennas as a function of a vector norm corresponding to said first receiver antenna, wherein said one or more transmitting antennas are operable to transmit the at least one complex symbol value to said first receiver antenna.
 13. A method of operating a transceiver including one or more transmitter antennas, one or more receiver antennas, and one or more propagation channels between the one or more transmitter antennas and the one or more receiver antenna, said method comprising: computing a metric proportional to an average injection power for each receiver antenna of the one or more receiver antennas; selecting a first antenna of the one or more receiver antennas having a smallest average injection power to receive at least one complex value symbol from the one or more transmitter antennas.
 14. The method of claim 13, wherein all computations of the metric proportional to the average injection power are according to: ${AIP}_{i} = \frac{1}{\sum\limits_{j = 0}^{M_{T} - 1}{h_{i,j}}^{2}}$


15. The method of claim 13, wherein all computations of the metric proportional to the average injection power are according to: ${AIP}_{i} = {\sum\limits_{k = 0}^{N - 1}\left( \frac{1}{\sum\limits_{j = 0}^{M_{T} - 1}\left| {H_{i,j}\lbrack k\rbrack} \right|^{2}} \right)}$


16. A method of operating a transceiver including one or more transmitter antennas, one or more receiver antennas, and one or more propagation channels between the one or more transmitter antennas and the one or more receiver antenna, said method comprising: computing a vector norm for each receiver antenna of the one or more receiver antennas; selecting a first antenna of the one or more receiver antennas having a largest vector norm to receive at least one complex value symbol from the one or more transmitter antennas.
 17. The method of claim 16, wherein all computations of the vector norm are according to: ${VN}_{i} = {{\sum\limits_{j = 0}^{M_{T} - 1}{h_{i,j}}^{2}} = {h_{i}}_{2}^{2}}$


18. The method of claim 16, wherein all computations of the vector norm are according to: ${VN}_{i} = {{\sum\limits_{k = 0}^{N - 1}\left( {\sum\limits_{j = 0}^{M_{T} - 1}\left| {H_{i,j}\lbrack k\rbrack} \right|^{2}} \right)} = {\sum\limits_{k = 0}^{N - 1}{{H_{i}\lbrack k\rbrack}}_{2}^{2}}}$


19. A transceiver, comprising: one or more transmitter antennas; one or more receiver antennas; one or more propagation channels between said one or more transmitter antennas and said one or more receiver antenna; and a module operable to compute a metric proportional to an average injection power for each receiver antenna of said one or more receiver antennas, said module further operable to select a first antenna of said one or more receiver antennas having a smallest average injection power to receive at least one complex value symbol from said one or more transmitter antennas.
 20. The transceiver of claim 19, wherein said module performs all computations of the metric proportional to the average injection power according to: ${AIP}_{i} = \frac{1}{\sum\limits_{j = 0}^{M_{T} - 1}{h_{i,j}}^{2}}$


21. The transceiver of claim 19, wherein said module performs all computations of the metric proportional to the average injection power according to: ${AIP}_{i} = {\sum\limits_{k = 0}^{N - 1}\left( \frac{1}{\sum\limits_{j = 0}^{M_{T} - 1}\left| {H_{i,j}\lbrack k\rbrack} \right|^{2}} \right)}$


22. A transceiver, comprising: one or more transmitter antennas; one or more receiver antennas; one or more propagation channels between said one or more transmitter antennas and said one or more receiver antenna; and a module operable to compute a vector norm for each receiver antenna of said one or more receiver antennas, said module further operable to select a first antenna of said one or more antennas having a largest vector norm to receive at least one complex value symbol from said one or more transmitter antennas.
 23. The transceiver of claim 22, wherein said module performs all computations of the vector norm according to: ${VN}_{i} = {{\sum\limits_{j = 0}^{M_{T} - 1}{h_{i,j}}^{2}} = {h_{i}}_{2}^{2}}$


24. The transceiver of claim 22, wherein said module performs all computations of the vector norm according to: ${VN}_{i} = {{\sum\limits_{k = 0}^{N - 1}\left( {\sum\limits_{j = 0}^{M_{T} - 1}\left| {H_{i,j}\lbrack k\rbrack} \right|^{2}} \right)} = {\sum\limits_{k = 0}^{N - 1}{{H_{i}\lbrack k\rbrack}}_{2}^{2}}}$ 